# Python 2.6.4
# Project Euler, Problem 53
# Copyright 2010 Talha Zaman

fac = [1]
for i in range(1,101): fac.append(fac[i-1]*i)
def C(n,k): return fac[n]/(fac[k]*fac[n-k])

count=0
for i in range(1,101):
    for j in range(1, i/2+2):
        if C(i,j)>1000000:
            count += i - 2*j + 1
            break
print count
